Divisible Load Scheduling and Markov Chain Models
نویسندگان
چکیده
In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree networks.
منابع مشابه
Modeling for Integration of Divisible Load Theory and Markov Chains
In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. The problem is to show optimal divisible load schedules for various network topologies have Markov chain analogs. This paper is a continuation of our initial short paper [1] that introduced this unification between divisible load theory and Markov chain models for ...
متن کاملOptimal Divisible Load Scheduling and Markov Chain Models
In this short paper we consider the equivalence between various load-scheduling policies and continuous time Markov chains. It provides a basic unification of both divisible load scheduling and Markov chains for the first time in 15 years of research. This unification is suggested by the fact that both divisible load scheduling theory and Markovian queueing theory have common features. I. Backg...
متن کاملLoad Balancing and Scheduling of Tasks in Parallel Processing Environment
This proposed model applies to scheduling and doing load balancing of the tasks in the parallel processing applications which can be divided into parts of arbitrary sizes, which in turn can be processed independently on remote computers. The objective is to come up with the optimal divisible load scheduling and balancing model to solve a computational problem in a minimal amount of time (with t...
متن کاملMulti-Criteria Based Algorithm for Scheduling Divisible Load
Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation...
متن کاملNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
In many data grid applications, data can be decomposed into multiple independent sub-datasets and distributed for parallel execution and analysis. This property has been successfully employed by using Divisible Load Theory (DLT), which has been proved as a powerful tool for modeling divisible load problems in data-intensive grid. There are some scheduling models have been studied but no optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 52 شماره
صفحات -
تاریخ انتشار 2006